In computer vision many problems are of non-deterministic polynomial time complexity. One of these problems is graph matching. Suboptimal solutions have been proposed to efficiently do graph matching. This thesis investigates ...